Robotic Owshop Scheduling Is Strongly Np-complete
نویسنده
چکیده
We consider a robotic owshop model in which a single robot is responsible for the transportation of parts between machines and the amount of time that a part spends on a machine must be comprised in some prede ned interval. The objective is to nd a feasible schedule with minimal cycle time. Many researchers have proposed nonpolynomial solution methods for a variety of closely related robotic owshop scheduling problems. This paper provides a proof that a basic version of this problem is strongly NP-Complete.
منابع مشابه
A New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کاملMinimizing Makespan in Flowshops with Pallet Requirements
We treat the problem of scheduling a owshop with pallet requirements. Each job in the owshop needs a pallet the entire time, from the start of its rst operation until the completion of the last operation, and the number of pallets in the shop at any given time is limited by an integer K. We prove that the problem is NP-hard in the strong sense for m 2 and K 3, and for m 3 and K 2, where m is th...
متن کاملA scalarization-based method for multiple part-type scheduling of two-machine robotic systems with non-destructive testing technologies
This paper analyzes the performance of a robotic system with two machines in which machines are configured in a circular layout and produce non-identical parts repetitively. The non-destructive testing (NDT) is performed by a stationary robotic arm located in the center of the circle, or a cluster tool. The robotic arm integrates multiple tasks, mainly the NDT of the part and its transition bet...
متن کاملProblem Structure and Owshop Scheduling
Many algorithms leverage structure to solve problems. In owshop scheduling , we study two types of structure. First, for each job, we generate processing times that are similar across all machines (job-correlated problems). Then, for each machine, we generate processing times that are similar for all the jobs (machine-correlated problems). For these types of problems, we study the innu-ence of ...
متن کاملScheduling by Positional Completion Times
We present a new type of formulation for scheduling problems where jobs are identical in all aspects but one. This type of formulation is particularly useful for deriving Lagrangian lower and upper bounds for owshop problems, where the jobs only diier in their processing times. We illustrate the eeectiveness of this type of formulation for a two-machine owshop problem where the rst machine is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997